Survivable Network Design Problem in the Case of Arc Failure

Survivable Multi-commodity Network Flow Design; Case of Node Capacities and Arc Failure

This paper was concerned with the problem of designing a survivable multicommodity network with node capacities, which is about selecting a set of fixed-charge arcs in order to build a survivable network with minimum cost and satisfied flow requirements. The system is subject to failure and capacity restriction. Failure is defined as simultaneous failure of arcs. To solve the problem, first, a ...

analysis of power in the network society

اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...

Survivable network design: the capacitated minimum spanning network problem

An efficient approximation algorithm for the survivable network design problem

The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-t ime approximation algorithm was given by Williamson et al. (Combinatorica 15 (1995) 435454) . This paper gives an improved version that is more efficient. Consider a graph of n vertices and connectivity requirements that are at most...

Benders decomposition for the hop-constrainted survivable network design problem

survivable network design problem Quentin Botton Center for Supply Chain Managemqent (CESCM), Louvain School of Management, Université catholique de Louvain, Louvain-la-Neuve, Belgium, and CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium, [email protected] Bernard Fortz GOM, Department of Computer Science, Faculté des Sciences, Université Libre de Bruxelles, Brussels,...